Time Independent Switching between Two Source Codes

Switching algorithms for combining sequential codes usually come with bounds, relating their performance to that of the best fixed strategy that switches m times. The overhead is parameterized by the number of outcomes n and the number of switches m; it may be difficult to judge whether this is acceptable. We present an alternative algorithm whose overhead does not depend on n; instead our bound expresses the overhead in terms of the benefit of switching in the first place.